A graph algorithm for linearizing simulink models

This paper presents a new efficient approach for performing linearization of Simulink R © models. It improves the efficiency of existing linearization algorithms using a Jacobian graph, a graph-based data structure that captures the linear relationship between input, output and state variables. The graphbased algorithm enables the use of graph transformations to reduce the size of the Jacobian data structure, thereby improving the efficiency of subsequent computations. This paper presents a heuristic implementation of the graph-based algorithm. Experimental results on a number of Simulink models of different sizes show how the approach is able to significantly improve computational efficiency and memory use especially in models with large numbers of blocks and states.